Level set driven smooth curve approximation from unorganized or noisy point set
نویسندگان
چکیده
منابع مشابه
Level Set Driven Smooth Curve Approximation from Unorganized or Noisy Point Set
In this paper, we propose a curve construction method for a non uniform point data set based on a minimal curve approximation model. Numerically, the level set method is used for curve reconstruction. We represent the shape of the curve through its distance function and formulate curve reconstruction as a constrained minimization problem. We solve the minimization problem on a highly anisotropi...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملLevel-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may be able to tell the position of a point on the boundary. Often boundary components split, merge, appear, and disappear over time. Data are typically sparse and noisy and the underlying dynamics is uncertain. To addre...
متن کاملComparing O set Curve Approximation
OOset curves have diverse engineering applications , which have consequently motivated extensive research concerning various ooset techniques. OOset research in the early 1980s focused on approximation techniques to solve immediate application problems in practice. This trend continued until 1988, when Hoschek 1, 2] applied non-linear optimization techniques to the ooset approximation problem. ...
متن کاملFinding a Curve in a Point Set
Let P be a polygonal curve in R of length n, and S be a point set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that its Fréchet distance from P is less than a given ε. In this paper, we consider this problem with the added freedom to transform the input curve P by translating it, rotating it, or applying an arbitrary affine transform. We pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Proceedings
سال: 2009
ISSN: 1270-900X
DOI: 10.1051/proc/2009031